Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions
نویسندگان
چکیده
We introduce a new approach for cryptanalysis of key agreement protocols based on noncommutative groups. This approach uses functions that estimate the distance of a group element to a given subgroup. We test it against the Shpilrain-Ushakov protocol, which is based on Thompson’s group F , and show that it can break about half the keys within a few seconds on a single PC.
منابع مشابه
Provably secure and efficient identity-based key agreement protocol for independent PKGs using ECC
Key agreement protocols are essential for secure communications in open and distributed environments. Recently, identity-based key agreement protocols have been increasingly researched because of the simplicity of public key management. The basic idea behind an identity-based cryptosystem is that a public key is the identity (an arbitrary string) of a user, and the corresponding private key is ...
متن کاملEfficient Encryption Schema Using Short Cipher Texts for Broadcasting
Traditional broadcast encryption (BE) schemes allow a sender to securely broadcast to any subset of members but require a trusted party to distribute decryption keys. Group key agreement (GKA) protocols enable a group of members to negotiate a common encryption key via open networks so that only the group members can decrypt the ciphertexts encrypted under the shared encryption key, but a sende...
متن کاملPolynomial time cryptanalysis of noncommutative-algebraic key exchange protocols
We introduce the linear centralizer method for a passive adversary to extract the shared key in group-theory based key exchange protocols (KEPs). We apply this method to obtain a polynomial time cryptanalysis of the Commutator KEP, introduced by Anshel–Anshel–Goldfeld in 1999 and considered extensively ever since. We also apply this method to the Centralizer KEP, introduced by Shpilrain–Ushakov...
متن کاملCryptanalysis of ID-based Tripartite Authenticated Key Agreement Protocols
In this paper, we show that the Nalla-Reddy’s one round IDbased tripartite authenticated key agreement protocols are still insecure against the man-in-the-middle attacks. We also break the Nalla’s IDbased tripartite authenticated key agreement protocol with signatures.
متن کاملCryptanalysis of three matrix-based key establishment protocols
We cryptanalyse a matrix-based key transport protocol due to Baumslag, Camps, Fine, Rosenberger and Xu from 2006. We also cryptanalyse two recently proposed matrix-based key agreement protocols, due to Habeeb, Kahrobaei and Shpilrain, and due to Romanczuk and Ustimenko.
متن کامل